A Characterization of Sturmian Words by Return Words

نویسنده

  • Laurent Vuillon
چکیده

1 R esum e: Nous pr esentons une nouvelle caract erisation des mots de Sturm bas ee sur les mots de retour. Si l'on consid ere chaque occurrence d'un mot w dans un mot innni r ecurrent, on d eenit l'ensemble des mots de retour de w comme l'ensemble de tous les mots distincts commenn cant par une occurrence de w et nissant exactement avant l'occurrence suivante de w. Le r esultat principal montre qu'un mot est sturmien si et seulement si pour chaque mot w non vide apparaissant dans la suite, la cardinalit e de l'ensemble des mots de retour de w est egale a deux. Abstract: We present a new characterization of Sturmian words using return words. Considering each occurrence of a word w in a recurrent word, we deene the set of return words over w to be the set of all distinct words beginning with an occurrence of w and ending exactly before the next occurrence of w in the innnite word. It is shown that an innnite word is a Sturmian word if and only if for each non-empty word w appearing in the innnite word, the cardinality of the set of return words over w is equal to two.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abelian returns in Sturmian words

Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of it...

متن کامل

Proceedings of the Workshop on Fibonacci Words Turku , September 2006

Recently, the notion of return words has appeared in various branches of mathematics, for instance in Symbolic Dynamical Systems and Number Theory. This mathematical tool has been introduced by Durand [2] in order to obtain a nice characterization of primitive substitutive sequences. Roughly speaking, for a given factor w of the infinite word u, a return word of w is a segment between two succe...

متن کامل

Quasiperiodic and Lyndon episturmian words

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in term...

متن کامل

A new geometric approach to Sturmian words

We introduce a new geometric approach to Sturmian words by means of a mapping that associates certain lines in the n× n-grid and sets of finite Sturmian words of length n. Using this mapping, we give new proofs of the formulas enumerating the finite Sturmian words and the palindromic finite Sturmian words of a given length. We also give a new proof for the well-known result that a factor of a S...

متن کامل

Some Properties of Abelian Return Words

We investigate some properties of abelian return words as recently introduced by Puzynina and Zamboni. In particular, we obtain a characterization of Sturmian words with nonzero intercept in terms of the finiteness of the set of abelian return words to all prefixes. We describe this set of abelian returns for the Fibonacci word but also for the 2-automatic Thue–Morse word. We also investigate t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2001